Second-Order SCA Security with almost no Fresh Randomness
نویسندگان
چکیده
Masking schemes are among the most popular countermeasures against Side-Channel Analysis (SCA) attacks. Realization of masked implementations on hardware faces several difficulties including dealing with glitches. Threshold Implementation (TI) is known as first strategy provable security in presence In addition to desired order d, TI defines minimum number shares also depend algebraic degree target function. This may lead unaffordable implementation costs for higher orders.For example, at least five required protect smallest nonlinear function second-order By cuttingsuch a dependency, successor able achieve same level by just d + 1 shares, cost high demand fresh randomness, particularly orders. this work, we provide methodology realize glitch-extended probing-secure group quadratic functions three and no randomness. allows us construct secure cryptographic primitives very limited masks, Keccak, SKINNY, Midori, PRESENT, PRINCE.
منابع مشابه
Almost Periodic Solutions of Second Order Nonlinear Differential Equations with Almost Periodic Forcing
متن کامل
No dedicated second-order motion system.
The existence of a second-order motion system distinct from both the first-order and feature tracking motion systems remains controversial even though many consider it well established. In the present study, the texture contribution to motion was measured within and beyond the spatial acuity of attention by presenting the stimuli in the near periphery where the spatial resolution of attention i...
متن کاملAlmost Periodic Solutions of First- and Second-Order Cauchy Problems
Almost periodicity of solutions of firstand second-order Cauchy problems on the real line is proved under the assumption that the imaginary (resp. real) spectrum of the underlying operator is countable. Related results have been obtained by Ruess Vu~ and Basit. Our proof uses a new idea. It is based on a factorisation method which also gives a short proof (of the vector-valued version) of Loomi...
متن کاملGeneral Randomness Amplification with Non-signaling Security
Highly unpredictable events appear to be abundant in life. However, when modeled rigorously, their existence in nature is far from evident. In fact, the world can be deterministic while at the same time the predictions of quantum mechanics are consistent with observations. Assuming that randomness does exist but only in a weak form, could highly random events be possible? This fundamental quest...
متن کاملRandomness-Dependent Message Security
Traditional definitions of the security of encryption schemes assume that the messages encrypted are chosen independently of the randomness used by the encryption scheme. Recent works, implicitly by Myers and Shelat (FOCS’09) and Bellare et al (AsiaCrypt’09), and explicitly by Hemmenway and Ostrovsky (ECCC’10), consider randomness-dependent message (RDM) security of encryption schemes, where th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transactions on cryptographic hardware and embedded systems
سال: 2021
ISSN: ['2569-2925']
DOI: https://doi.org/10.46586/tches.v2021.i3.708-755